PStable Semantics for Possibilistic Logic Programs
نویسندگان
چکیده
Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable semantics. Possibilistic logic is a logic of uncertainty tailored for reasoning under incomplete evidence and Pstable Semantics is a solid semantics which emerges from the fusion of non-monotonic reasoning and logic programming; moreover it is able to express answer set semantics, and has strong connections with paraconsistent logics.
منابع مشابه
Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of sel...
متن کاملPossibilistic Well-Founded Semantics
Recently, a good set of logic programming semantics has been defined for capturing possibilistic logic program. Practically all of them follow a credulous reasoning approach. This means that given a possibilistic logic program one can infer a set of possibilistic models. However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. One of t...
متن کاملPossibilistic and Extended Logic Programs
Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to ...
متن کاملPstable Tool and Its Aplication
present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse. Also we show the utility of an automatic demonstrator implemented with these tools for applications where the logic has consistence problems. I. INTRODUCTION The stable model semantics for logic programming support it self within the non-monotonic reasoning, [1]. This approach...
متن کاملPossibilistic Nested Logic Programs
We introduce the class of possibilistic nested logic programs. These possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibili...
متن کامل